Adaptive Optimization with Constraints: Convergence and Oscillatory Behaviour
نویسندگان
چکیده
The problem of adaptive minimization of globally unknown functionals under constraints on the independent variable is considered in a stochastic framework. The CAM algorithm for vector problems is proposed. By resorting to the ODE analysis for analysing stochastic algorithms and singular perturbation methods, it is shown that the only possible convergence points are the constrained local minima. Simulation results in 2 dimensions illustrate this result.
منابع مشابه
Airfoil Shape Optimization with Adaptive Mutation Genetic Algorithm
An efficient method for scattering Genetic Algorithm (GA) individuals in the design space is proposed to accelerate airfoil shape optimization. The method used here is based on the variation of the mutation rate for each gene of the chromosomes by taking feedback from the current population. An adaptive method for airfoil shape parameterization is also applied and its impact on the optimum desi...
متن کاملControl of the finite element discretization error during the convergence of structural shape optimization algorithms
This work analyzes the influence of the discretization error contained in the Finite Element (FE) analyses of each design configuration proposed by structural shape optimization algorithms over the behaviour of the algorithm. If the FE analyses are not accurate enough, the final solution will neither be optimal nor satisfy the constraints. The need for the use of adaptive FE analysis techniques...
متن کاملOPTIMUM DESIGN OF REINFORCED CONCRETE FRAMES USING BAT META-HEURISTIC ALGORITHM
The main aim of the present study is to achieve optimum design of reinforced concrete (RC) plane moment frames using bat algorithm (BA) which is a newly developed meta-heuristic optimization algorithm based on the echolocation behaviour of bats. The objective function is the total cost of the frame and the design constraints are checked during the optimization process based on ACI 318-08 code. ...
متن کاملA limited memory adaptive trust-region approach for large-scale unconstrained optimization
This study concerns with a trust-region-based method for solving unconstrained optimization problems. The approach takes the advantages of the compact limited memory BFGS updating formula together with an appropriate adaptive radius strategy. In our approach, the adaptive technique leads us to decrease the number of subproblems solving, while utilizing the structure of limited memory quasi-Newt...
متن کاملA New Shuffled Sub-swarm Particle Swarm Optimization Algorithm for Speech Enhancement
In this paper, we propose a novel algorithm to enhance the noisy speech in the framework of dual-channel speech enhancement. The new method is a hybrid optimization algorithm, which employs the combination of the conventional θ-PSO and the shuffled sub-swarms particle optimization (SSPSO) technique. It is known that the θ-PSO algorithm has better optimization performance than standard PSO al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005